Industrial Engineering and Computer Sciences Division (G2I) SCHEDULING FOR MULTI-SPINDLE HEAD MACHINES WITH A MOBILE TABLE
نویسندگان
چکیده
We study the problem of minimizing makespan for part machining on a multi-spindle heads machine with a mobile table. We show that this problem can be formulated as a scheduling problem for a single batch machine with compatibility and precedence constraints between jobs. Jobs grouped in a batch are processed simultaneously, but the difference from considered in the literature max-batch machine lies in the fact that batch processing time can exceed the time of the longest job of the batch. It depends on the batch content, i.e. which jobs constitute the batch. The scheduling problem is transformed into a problem of finding the constrained shortest path problem in specially constructed digraph. An industrial example is presented.
منابع مشابه
Industrial Engineering and Computer Sciences Division (G2I) COMPARATIVE ANALYSIS OF EXACT AND HEURISTIC METHODS FOR A TRANSFER LINE BALANCING PROBLEM
The Transfer Line Balancing Problem (TLBP) deals with the optimization of design solutions for serial machining lines. Such lines consist of a sequence of transfer machines. At every machine, the operations are performed by blocks. The blocks are processed sequentially and the operations within each block are executed simultaneously by the same multi-spindle head. The line design objective is t...
متن کاملIndustrial Engineering and Computer Sciences Division (G2I) AN INTEGER PROGRAMMING MODEL FOR LOGICAL LAYOUT DESIGN OF MODULAR MACHINING LINES
The problem of designing a modular manufacturing lines is addressed. The modules are multi-spindle units and each unit executes simultaneously a subset of operations. This paper presents an approach to select the right spindle units and to arrange them into linear workstations. Our objective is to design such lines respecting technological constraints by minimizing the investment cost, which ta...
متن کاملIndustrial Engineering and Computer Sciences Division (G2I) MULTI-PRODUCT LOT SIZING AND SCHEDULING ON UNRELATED PARALLEL MACHINES
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کامل